Space-Filling Curves for Quantum Control Parameters
نویسنده
چکیده
We consider the use of space-filling curves (SFC) in scanning control parameters for quantum chemical systems. First we show that a formally exact SFC must be singular in the control parameters, but a finite discrete generalization can be used with no problem. We then make general observations about the relevance of SFCs in preference to linear scans of the parameters. Finally we present a simple magnetic field example relevant in NMR and show from the calculated autocorrelations that a SFC Peano-Hilbert curve gives a smoother sequence than a linear scan. c © Electronic Journal of Theoretical Physics. All rights reserved.
منابع مشابه
One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملRecurrence for Pandimensional Space-Filling Functions
A space-filling function is a bijection from the unit line segment to the unit square, cube, or hypercube. The function from the unit line segment is continuous. The inverse function, while welldefined, is not continuous. Space-filling curves, the finite approximations to space-filling functions, have found application in global optimization, database indexing, and dimension reduction among oth...
متن کاملNorm-Based Locality Measures of Two-Dimensional Hilbert Curves
A discrete space-filling curve provides a 1-dimensional indexing or traversal of a multi-dimensional grid space. Applications of space-filling curves include multi-dimensional indexing methods, parallel computing, and image compression. Common goodness-measures for the applicability of space-filling curve families are locality and clustering. Locality reflects proximity preservation that close-...
متن کاملTime Complexity of algorithms that update the Sierpiński-like and Modified Hilbert Curves
This paper presents the time complexity of two algorithms that update space-filling curves of adaptively refined domains. The Modified Hilbert (space-filling) Curve was proposed to traverse square-shaped adaptive-refined meshes. Whereas, the Sierpiński-like (space-filling) Curve was proposed in order to traverse triangular-shaped adaptive-refined meshes. Those curves are variations of the names...
متن کاملOn the metric properties of discrete space-filling curves
A space-filling curve is a linear traversal of a discrete finite multidimensional space. In order for this traversal to be useful in many applications, the curve should preserve "locality". We quantify "locality" and bound the locality of multidimensional space-filling curves. Classic Hilbert space-filling curves come close to achieving optimal locality.
متن کامل